Proof Planning for Feature Interactions: A Preliminary Report
نویسندگان
چکیده
We report on an initial success obtained in investigating the Feature Interaction problem (FI) via proof planning. FIs arise as an unwanted/unexpected behaviour in large telephone networks and have recently attracted interest not only from the Computer Science community but also from the industrial world. So far, FIs have been solved mainly via approximation plus finite-state methods (model checking being the most popular); in our work we attack the problem via proof planning in First-Order Linear Temporal Logic (FOLTL), therefore making use of no finite-state approximation or restricting assumption about quantification. We have integrated the proof planner λCLAM with an object-level FOLTL theorem prover called FTL, and have so far re-discovered a feature interaction in a basic (but far from trivial) example.
منابع مشابه
Integrating Planning and Reaction a Preliminary Report Integrating Planning and Reaction a Preliminary Report
This paper is a preliminary report on the Entropy Reduction Engine architecture for integrating planning, scheduling, and control. The architecture is motivated through a NASA mission scenario and a brief list of design goals. The main body of the paper presents an overview of the Entropy Reduction Engine architecture by describing its major components, their interactions, and the way in which ...
متن کاملRagionamento Automatico per Logiche Modali e Temporali Quantificate Automated Reasoning in Quantified Modal and Temporal Logics
SOMMARIO/ABSTRACT Descriviamo in questo articolo la tesi di dottorato dell'autore, centrata sul ragionamento automatico nelle logiche modali e temporali quantificate. I contributi origi-nali della tesi sono: (i) la formulazione di una famiglia di calcoli di sequenti corretti e completi per le logiche modali quantificate; (ii) l'estensione dell'approccio alla logica temporale quantificata del te...
متن کاملSZTAKI @ ImageCLEF 2008: Visual Concept Detection
We describe our approach to the ImageCLEF-VisualConcept 2008 task. Our method is based on image segmentation, using a feature vector describing the visual content of image segments or the entire image. Logistic regression was used for classi cation. Images were segmented by a home developed segmenter. While in this preliminary report classi cation by global image features performed best, prelim...
متن کاملSeki Report Progress in Proof Planning: Planning Limit Theorems Automatically
Proof planning is an alternative methodology to classical automated theorem proving based on exhaustive search that was rst introduced by Bundy [8]. The goal of this paper is to extend the current realm of proof planning to cope with genuinely mathematical problems such as the well-known limit theorems rst investigated for automated theorem proving by Bledsoe. The report presents a general meth...
متن کاملProof Planning for First-Order Temporal Logic
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal Logic (FOLTL), which can be seen as a quantified version of Linear Temporal Logic, overcoming its finitary limitation. Automated reasoning in FOLTL is hard, since it is non-recursively enumerable; but its expressivenes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002